EFFICIENT ROUTING ON SCALE-FREE NETWORKS
نویسندگان
چکیده
منابع مشابه
Efficient routing on scale-free networks based on local information
In this letter, we propose a new routing strategy with a single free parameter α only based on local information of network topology. In order to maximize the packets handling capacity of underlying structure that can be measured by the critical point of continuous phase transition from free flow to congestion, the optimal value of α is sought out. By investigating the distributions of queue le...
متن کاملEfficient and robust routing on scale-free networks
Information routing is one of the most important problems in large communication networks. In this paper we propose a novel routing strategy in which the optimal paths between all pairs of nodes are chosen according to a cost function that incorporates degrees of nodes in paths. Results on large scale-free networks demonstrate that our routing strategy ismore efficient than the shortest path al...
متن کاملEfficient routing strategies in scale-free networks with limited bandwidth
We study the traffic dynamics in complex networks where each link is assigned a limited and identical bandwidth. Although the first-in-first-out (FIFO) queuing rule is widely applied in the routing protocol of information packets, here we argue that if we drop this rule, the overall throughput of the network can be remarkably enhanced. We propose some efficient routing strategies that do not st...
متن کاملTraffic Flow and Efficient Routing on Scale-Free Networks: A Survey
Recently, motivated by the pioneering that have revealed the small-world effect and scale-free property of various real-life networks, many scientists are devoting themselves to studying complex networks. In this paper, we give a brief review of studies on traffic flow and efficient routing on scale-free networks, including traffic dynamics based on the global routing protocol, traffic dynamics...
متن کاملEfficient path routing strategy for flows with multiple priorities on scale-free networks
In real networks, traffic flows are different in amount as well as their priorities. However, the latter priority has rarely been examined in routing strategy studies. In this paper, a novel routing algorithm, which is based on the efficient path routing strategy (EP), is proposed to overcome network congestion problem caused by large amount of traffic flows with different priorities. In this s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Physics B
سال: 2007
ISSN: 0217-9792,1793-6578
DOI: 10.1142/s0217979207045232